Instructor : Emanuele Viola Scribe : Eric Miles Cryptography in constant depth : II & III 1 Locally computable randomized encodings
نویسنده
چکیده
Our first attempt at transforming this group program into a randomized encoding of f is to define f ′(x) := (g xk1 1 , . . . , g xkl l ). We can check if the necessary properties are satisfied: • It’s locally computable, because each element in the output depends on one bit of x. • f(x) 6= f(x′)⇒ f ′(x) 6= f ′(x′) • Unfortunately, we cannot hope to find a distributionD of circuits C such that C(f(x)) ≡ f ′(x), because the input to each circuit is only a single bit.
منابع مشابه
Instructor : Emanuele Viola Scribe : Eric Miles Parity requires large constant - depth circuits ( II ) Correlation bounds for parity
Then, let q(x) = ∑ m∈M (am ·m(x)) be the weighted sum of these monomials, for a set of weights {am}m∈M . We want to choose the weights in order to give q the properties already stated, which is equivalent to finding a non-trivial solution to a certain system of equations. Denote S = {s1, . . . , s|S|} and M = {m1, . . . ,m|M |}. Then, the system of equations we would like to solve is m1(s1...
متن کاملSuccinct and explicit circuits for sorting and connectivity
We study which functions can be computed by efficient circuits whose gate connections are very easy to compute. We give quasilinear-size circuits for sorting whose connections can be computed by decision trees with depth logarithmic in the length of the gate description. We also show that NL has NC2 circuits whose connections can be computed with constant locality. ∗Supported by NSF grants CCF-...
متن کامل1 Administrative Notes For those keeping track : the instructor of “ Advanced Cryptography ” is
By a somewhat democratic process, it was established that the graded work for the course will be two-fold: scribe notes (such that the participants and the instructor emerge with a relatively complete set of lecture notes) and homework exercises (probably three sets of challenging-butnot-life-threatening problems, such that everybody gets some practice solving problems and the instructor may om...
متن کاملLocal Reductions
We reduce non-deterministic time T ≥ 2n to a 3SAT instance φ of size |φ| = T · log T such that there is an explicit circuit C that on input an index i of log |φ| bits outputs the ith clause, and each output bit of C depends on O(1) inputs bits. The previous best result was C in NC1. Even in the simpler setting of |φ| = poly(T ) the previous best result was C in AC0. More generally, for any time...
متن کاملAre all distributions easy?
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}n → {0, 1}m of a given input x. We advocate the study of the complexity of generating the distribution h(x) for uniform x, given random bits. Our main results are: • There are explicit AC circuits of size poly(n) and depth O(1) whose output distribution has statistical distance 1/2n from the distribution (X,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009